A Fixed-Rate Quantizer Using Block-Based Entropy-Constrained Quantization and Run-Length Coding

نویسندگان

  • Dongchang Yu
  • Michael W. Marcellin
چکیده

II Nine possible options for (y 1 ; y 2) together with coded bits and their lengths. : 8 III The Huuman table for Example 4 abstract In this paper, we develop a fast and eecient quantization technique which is xed-length, robust to bit errors, and compatible with most current compression standards. It is based on entropy-constrained quantization and uses an eecient delayed decision algorithm to force the coded sequence to be xed-rate. Run-length coding techniques are used to improve the performance at low encoding rates. Simulation results show that it can achieve performance comparable to that of Huuman coded entropy-constrained scalar quantization with computational complexity increasing only linearly in block length.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lattice/Trellis based Fixed-rate Entropy-constrained Quantization

The fixed-rate entropy-constrained vector quantizer draws its motivation from the large gap in the performance of the optimal entropy-constrained scalar quantizer (ESCQ) and the fixed-rate LMQ for most non-uniform sources and tries to bridge this gap while maintaining a fixed-rate output. Having a fixed-rate output avoids all problems associated with a variable rate output such as error propaga...

متن کامل

Soft Decision Decoding of Fixed Rate Entropy Constrained Quantizer over a Noisy Channel

Variable-length codes (e.g. Huuman codes) are commonly employed to minimize the average binary code-word length in the quantization of discrete sources. However , the eeect of error propagation limits the usefulness of variable length codes for the transmission over noisy channels. To avoid this shortcoming, one can use a xed-rate entropy constrained quantizer, limiting the propagation of error...

متن کامل

Joint thresholding and quantizer selection for transform image coding: entropy-constrained analysis and applications to baseline JPEG

Striving to maximize baseline (Joint Photographers Expert Group-JPEG) image quality without compromising compatibility of current JPEG decoders, we develop an image-adaptive JPEG encoding algorithm that jointly optimizes quantizer selection, coefficient "thresholding", and Huffman coding within a rate-distortion (R-D) framework. Practically speaking, our algorithm unifies two previous approache...

متن کامل

Soft Decision Decoding of a Fixed-rate Entropy-coded Trellis Quantizer over a Noisy Channel

This report presents some new techniques to improve the performance of a Fixedrate Entropy-coded Trellis Quantizer (FE-TCQ) in transmission over a noisy channel. In this respect, we rst present the optimal decoder for a Fixed-rate Entropy-coded Vector Quantizer (FEVQ). A trellis structure is used to model the set of possible codewords in the FEVQ and the Viterbi algorithm is subsequently applie...

متن کامل

Quantization as Histogram Segmentation: Globally Optimal Scalar Quantizer Design in Network System

We propose a polynomial-time algorithm for optimal scalar quantizer design on discrete-alphabet sources. Special cases of the proposed approach yield optimal design algorithms for fixed-rate and entropy-constrained scalar quantizers, multi-resolution scalar quantizers, multiple description scalar quantizers, and Wyner-Ziv scalar quantizers. The algorithm guarantees globally optimal solutions fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997